Data-parallel concurrent constraint programming
نویسندگان
چکیده
منابع مشابه
Performance of a Data-Parallel Concurrent Constraint Programming System
Firebird 12] is a data-parallel concurrent constraint programming system. It is shown that nite domain constraint languages can be implemented on massively parallel SIMD machines. Firebird has been further enhanced with parallel backtracking capability and the design of the Data-Parallel Abstract Machine, the basis of Firebird's implementation, has been presented in 13]. An almost complete impl...
متن کاملImplementation of a Data-parallel Concurrent Constraint Programming System
In 12], we proposed Firebird, a new concurrent constraint programming language 9] which supports both concurrency and data-parallelism. Committed-choice indeterminism and don't know nondeterminism are integrated, but in a manner diierent from the Andorra Model 16]. Instead of nondeterminate clauses, nite domain variables form the basis of don't know nondeterminism in Firebird. After a domain va...
متن کاملTruly Concurrent Constraint Programming
We study “causality” relationships in Concurrent Constraint Programming: what is observed is not just the conjunction of constraints deposited in the store, but also the causal dependencies between these constraints. We describe a denotational semantics for cc that is fully-abstract with respect to observing this “causality” relation on constraints. This semantics preserves more fine-grained st...
متن کاملA Highly Parallel Model for Object-Oriented Concurrent Constraint Programming
Two of the currently most promising programming paradigms, namely Object-Oriented Programming and Concurrent Constraint Programming are combined into a single, highly parallel computational model based on Term Graph Rewriting Systems. In particular, we show how multi-headed Term Graph rewrite rules provide a powerful tool able to manipulate Term Graphs which themselves represent in a homogeneou...
متن کاملSubexponential concurrent constraint programming
In previous works we have shown that linear logic with subexponentials (SELL), a refinement of linear logic, can be used to specify emergent features of concurrent constraint programming (CCP) languages, such as preferences and spatial, epistemic and temporal modalities. In order to do so, we introduced a number of extensions to SELL, such as subexponential quantifiers for the specification of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1998
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(97)10003-6